Regularized nonsymmetric correspondence analysis

نویسندگان

  • Yoshio Takane
  • Sunho Jung
چکیده

Nonsymmetric correspondence analysis (NSCA) is designed to analyze two-way contingency tables in which rows and columns assume an asymmetric role, e.g., columns depend on rows, but not vice versa. A ridge type of regularization was incorporated into a variety of NSCA: Ordinary NSCA, and Partial and/or Constrained NSCA. The regularization has proven useful in obtaining estimates of parameters, which are on average closer to the true population values. An optimal value of the regularization parameter is found by a G-fold cross validation method, and the best dimensionality of the solution space is determined by permutation tests. A bootstrap method is used to evaluate the stability of the solution. A small Monte Carlo study and an illustrative example demonstrate the usefulness of the proposed procedures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tests of ignoring and eliminating in nonsymmetric correspondence analysis

Nonsymmetric correspondence analysis (NSCA) aims to examine predictive relationships between rows and columns of a contingency table. The predictor categories of such tables are often accompanied by some auxiliary information. Constrained NSCA (CNSCA) incorporates such information as linear constraints on the predictor categories. However, imposing constraints also means that part of the predic...

متن کامل

Handling Missing Values with Regularized Iterative Multiple Correspondence Analysis

A common approach to deal with missing values in multivariate exploratory data analysis consists in minimizing the loss function over all non-missing elements. This can be achieved by EM-type algorithms where an iterative imputation of the missing values is performed during the estimation of the axes and components. This paper proposes such an algorithm, named iterative multiple correspondence ...

متن کامل

Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions

We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning large-scale overdetermined or underdetermined systems of linear equations. The computation is performed efficiently and stably based on the modified alternating least squares (MALS) schem...

متن کامل

Properties of the nonsymmetric Robinson-Schensted-Knuth algorithm

We introduce a generalization of the Robinson-Schensted-Knuth algorithm to composition tableaux involving an arbitrary permutation. If the permutation is the identity our construction reduces to Mason’s original composition Robinson-Schensted-Knuth algorithm. In particular we develop an analogue of Schensted insertion in our more general setting, and use this to obtain new decompositions of the...

متن کامل

Koornwinder polynomials and the XXZ spin chain

Nonsymmetric Koornwinder polynomials are multivariable extensions of nonsymmetric Askey-Wilson polynomials. They naturally arise in the representation theory of (double) affine Hecke algebras. In this paper we discuss how nonsymmetric Koornwinder polynomials naturally arise in the theory of the Heisenberg XXZ spin1 2 chain with general reflecting boundary conditions. A central role in this stor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2009